Irreducible Values of Polynomials: a Non-analogy
نویسنده
چکیده
For a polynomial f(T ) ∈ Z[T ], the frequency with which the values f(n) are prime has been considered since at least the 18-th century. Euler observed, in a letter to Goldbach in 1752, that the sequence n + 1 has many prime values for 1 ≤ n ≤ 1500. Legendre assumed an arithmetic progression an+ b with (a, b) = 1 contains infinitely many primes in his work on the quadratic reciprocity law. There is also the old question of twin prime pairs n and n+2, but we will focus here only on a single polynomial (in one variable). An asymptotic estimate for
منابع مشابه
Symmetry classes of polynomials associated with the dihedral group
In this paper, we obtain the dimensions of symmetry classes of polynomials associated with the irreducible characters of the dihedral group as a subgroup of the full symmetric group. Then we discuss the existence of o-basis of these classes.
متن کاملPrime Numbers and Irreducible Polynomials
The similarity between prime numbers and irreducible polynomials has been a dominant theme in the development of number theory and algebraic geometry. There are certain conjectures indicating that the connection goes well beyond analogy. For example, there is a famous conjecture of Buniakowski formulated in 1854 (see Lang [3, p. 323]), independently reformulated by Schinzel, to the effect that ...
متن کاملA New Algebraic Method to Search Irreducible Polynomials Using Decimal Equivalents of Polynomials over Galois Field GF(p^q)
Irreducible polynomials play an important role till now, in construction of 8-bit S-Boxes in ciphers. The 8-bit S-Box of Advanced Encryption Standard is a list of decimal equivalents of Multiplicative Inverses (MI) of all the elemental polynomials of a monic irreducible polynomial over Galois Field GF(2) [1]. In this paper a new method to search monic Irreducible Polynomials (IPs) over Galois f...
متن کاملSingular Polynomials for the Symmetric Groups
For certain negative rational numbers κ0, called singular values, and associated with the symmetric group SN on N objects, there exist homogeneous polynomials annihilated by each Dunkl operator when the parameter κ = κ0. It was shown by the author, de Jeu and Opdam (Trans. Amer. Math. Soc. 346 (1994), 237-256) that the singular values are exactly the values − n with 2 ≤ n ≤ N , m = 1, 2, . . . ...
متن کاملProperties of Random Graphs via
We study the Hamming distance from polynomials to classes of polynomials that share certain properties of irre-ducible polynomials. The results give insight into whether or not irreducible polynomials can be effectively modeled by these more general classes of polynomials. For example, we prove that the number of degree n polynomials of Hamming distance one from a randomly chosen set of 2 n /n ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005